Time complexity

Results: 894



#Item
791Theoretical computer science / Finite fields / Integer sequences / Integer factorization algorithms / AKS primality test / Lucas–Lehmer primality test / Prime number / Time complexity / Fast Fourier transform / Mathematics / Primality tests / Abstract algebra

On the implementation of AKS-class primality tests R. Crandall* and J. Papadopoulos**

Add to Reading List

Source URL: www.dm.unito.it

Language: English - Date: 2005-11-17 04:47:46
792Analysis of algorithms / Number theory / Computational complexity theory / Integer sequences / Asymptotic analysis / Big O notation / Time complexity / Euler–Mascheroni constant / Euclidean algorithm / Mathematics / Theoretical computer science / Mathematical analysis

An Introduction to Mathematical Methods in Combinatorics Renzo Sprugnoli

Add to Reading List

Source URL: www.dsi.unifi.it

Language: English - Date: 2009-12-17 03:41:51
793Boolean algebra / Logic in computer science / NP-complete problems / Combinatorics / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Partition / True quantified Boolean formula / Theoretical computer science / Mathematics / Computational complexity theory

Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer

Add to Reading List

Source URL: ovid.cs.depaul.edu

Language: English - Date: 2008-10-05 12:49:10
794Complexity classes / P versus NP problem / Co-NP / NP / P / Decision problem / Time complexity / Reduction / NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics

P , NP and mathematics – a computational complexity perspective Avi Wigderson

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:58:44
795Computational complexity theory / Digital signal processing / Polynomial / Fast Fourier transform / Euclidean algorithm / Multiplication algorithm / Splitting circle method / Discrete Fourier transform / Time complexity / Mathematics / Theoretical computer science / Applied mathematics

Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:44:45
796Digital signal processing / Multiplication / Computer arithmetic / Computational complexity theory / Analysis of algorithms / Multiplication algorithm / Fibonacci number / Euclidean algorithm / Time complexity / Mathematics / Theoretical computer science / Applied mathematics

Lecture Notes for Algorithm Analysis and Design Sandeep Sen1 November 6, 2013

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2013-11-05 21:54:26
797Analysis of algorithms / Complexity classes / Mathematical optimization / Time complexity / NP / Algorithm / Big O notation / P / Fast Fourier transform / Theoretical computer science / Applied mathematics / Computational complexity theory

Algorithms and Complexity Herbert S. Wilf

Add to Reading List

Source URL: www.math.upenn.edu

Language: English - Date: 2004-04-28 15:32:06
798Complexity classes / Probabilistic complexity theory / Analysis of algorithms / Quantum complexity theory / Bounded-error probabilistic polynomial / PP / Randomized algorithm / Probabilistic Turing machine / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

i Computational Complexity: A Modern

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2007-01-08 22:01:30
799Analysis of algorithms / Group theory / Finite fields / Polynomial / Primality tests / Time complexity / Prime number / Elliptic curve / P / Theoretical computer science / Abstract algebra / Mathematics

ABSTRACT Title of dissertation:

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2007-09-25 23:26:55
800NP-complete problems / Logic in computer science / Exponential time hypothesis / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Time complexity / Parameterized complexity / Dominating set / Theoretical computer science / Computational complexity theory / Applied mathematics

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-11-12 23:47:30
UPDATE